Comparison of the Polynomial and Optimal Normal Basis Ecdsa for Gf(2162)
نویسندگان
چکیده
The paper describes FPGA implementation of cryptographic coprocessor performing operations on elliptic curve points with coordinates in GF (2). Polynomial basis and normal basis arithmetic units are presented and compared. Hardware implementation of GCD inversion in polynomial basis is described. Where an optimal normal basis exists, the normal basis arithmetic performs better. The digit width of 6 is shown to give the best area/performance ratio for optimal normal basis arithmetic.
منابع مشابه
Normal Basis Multiplication Algorithm for GF ( 2 n ) ( Full Version )
In this paper, we propose a new normal basis multiplication algorithm for GF(2). This algorithm can be used to design not only fast software algorithms but also low complexity bit-parallel multipliers in some GF(2)s. Especially, for some values of n that no Gaussian normal basis exists in GF(2), i.e., 8|n, this algorithm provides an alternative way to construct low complexity normal basis multi...
متن کاملNormal Basis Multiplication Algorithms for GF(2n) (Full Version)
In this paper, we propose a new normal basis multiplication algorithm for GF(2). This algorithm can be used to design not only fast software algorithms but also low complexity bit-parallel multipliers in some GF(2)s. Especially, for some values of n that no Gaussian normal basis exists in GF(2), i.e., 8|n, this algorithm provides an alternative way to construct low complexity normal basis multi...
متن کاملExploration of Design Space in ECDSA
The paper describes FPGA implementation of cryptographic coprocessor performing operations on elliptic curve points with coordinates in GF (2). Polynomial basis and normal basis arithmetic units are presented and compared. Hardware implementation of GCD inversion in polynomial basis is described. Where an optimal normal basis exists, the normal basis arithmetic performs better. The digit width ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملEfficient Arithmetic in GF(2n) through Palindromic Representation
finite field representation, optimal normal basis, palindromic representation A representation of the field GF(2n) for various values of n is described, where the field elements are palindromic polynomials, and the field operations are polynomial addition and multiplication in the ring of polynomials modulo x2n+1–1. This representation can be shown to be equivalent to a field representation of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002